Genetic Algorithms for Instruction Sequencing and Scheduling

In forming a complete schedule for jobs (such as instructions on a processor capable of multiple instruction issue), two independent operations occur: sequencing of the jobs and scheduling those prioritized jobs. This paper discusses the importance of the distinction between sequencing and scheduling, and gives a number of examples based on instruction scheduling to clarify the differences. It then discusses the application of Genetic Algorithms to different types of sequencing and scheduling problems.